NEXP is not in ACC 0
نویسنده
چکیده
ACC is the class of all problems computable by constant depth, unbounded fan-in circuits with ∧,∨,¬ and MODm gates for any constant m. A related class to ACC is P/poly, which contains all problems computable by polynomial-size circuits with ∧,∨, and ¬ gates. IfC is a circuit with n inputs, then we use tt(C) to denote the string of length 2 obtained by evaluating C on all 2 possible inputs in lexicographic order and concatenating all of the resulting strings (the tt stands for truth table). Sometimes when we discuss circuits C that take multiple inputs, we will want to hardwire some of the inputs of C and leave the rest of the inputs unset. If this is the case, then we will write C(x, ·), which denotes the circuit obtained by hardwiring the first |x| inputs of C using the values in x, and leaving the rest of the inputs unset. The following is a canonical NEXP-Complete problem.
منابع مشابه
An Average-Case Lower Bound against ACC
In a seminal work, Williams [26] showed that NEXP (non-deterministic exponential time) does not have polynomial-size ACC circuits. Williams’ technique inherently gives a worst-case lower bound, and until now, no average-case version of his result was known. We show that there is a language L in NEXP (resp. EXP) and a function ε(n) = 1/ log(n) (resp. 1/n) such that no sequence of polynomial size...
متن کاملUniform Circuits, Lower Bounds, and QBF Algorithms
We explore the relationships between circuit complexity, the complexity of generating circuits, and circuit-analysis algorithms. Our results can be roughly divided into three parts: • Lower Bounds Against Medium-Uniform Circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex but not infeasible. We prove several uncondit...
متن کاملNEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth
ACCm circuits are circuits consisting of unbounded fan-in AND, OR and MODm gates and unary NOT gates, where m is a fixed integer. We show that there exists a language in non-deterministic exponential time which can not be computed by any non-uniform family of ACCm circuits of quasipolynomial size and o(log log n) depth, where m is an arbitrarily chosen constant.
متن کاملIronic Complicity: Satisfiability Algorithms and Circuit Lower Bounds
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP 6⊆ ACC, which proceeds via a new algorithm for ACC-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in the...
متن کاملNon-autoreducible Sets for NEXP
We investigate autoreducibility properties of complete sets for NEXP under different polynomial reductions. Specifically, we show under some polynomial reductions that there is are complete sets for NEXP that are not autoreducible. We obtain the following results: • There is a ≤ptt -complete set for NEXP that is not ≤ p btt -autoreducible. • For any positive integers s and k such that 2 − 1 > k...
متن کامل